Reed-Muller Realization of X (mod P)

نویسنده

  • Danila A. Gorodecky
چکیده

This article provides a novel technique of X (mod P) realization. It is based on the Reed-Muller polynomial expansion. The advantage of the approach concludes in the capability to realize X (mod P) for an arbitrary P. The approach is competitive with the known realizations on the speed processing. Advantages and results of comparison with the known approaches for X [9:1] and P=7 is demonstrated. Keywords—modular arithmetic, residue number system, X (mod P), Reed-Muller expansion

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the integrality of nth roots of generating functions

Motivated by the discovery that the eighth root of the theta series of the E8 lattice and the 24th root of the theta series of the Leech lattice both have integer coefficients, we investigate the question of when an arbitrary element f ∈ R (where R = 1 + xZ x ) can be written as f = gn for g ∈ R, n 2. Let Pn := {gn | g ∈R} and let μn := n∏p |n p. We show among other things that (i) for f ∈R, f ...

متن کامل

An ASIC Architecture for Generating Optimum Mixed Polarity Reed-Muller Expression

Abstract: Logic function realization using Reed-Muller (RM) expression has manifold advantages over realization using SOP expression. In this paper, we present an ASIC architecture for generating optimum 3-variable mixed polarity RM expression. The ASIC based minimization is much faster than the software based minimization. The design is modeled using Verilog HDL and synthesized using Quartus I...

متن کامل

The Treewidth of MDS and Reed-Muller Codes

The constraint complexity of a graphical realization of a linear code is the maximum dimension of the local constraint codes in the realization. The treewidth of a linear code is the least constraint complexity of any of its cycle-free graphical realizations. This notion provides a useful parametrization of the maximum-likelihood decoding complexity for linear codes. In this paper, we prove the...

متن کامل

Double Fixed-Polarity Reed-Muller Expressions: A New Class of AND-EXOR Expressions for Compact and Testable Realization

As classes of AND-EXOR expressions, PPRMs, FPRMs, and ESOPs are well-known. In this paper, a new class of AND-EXOR expressions, Double Fixed-Polarity Reed-Muller Expressions (DFPRMs), is proposed. DFPRMs are generalized expressions of FPRMs, and can be the smallest PLA among all the classes of AND-EXOR expressions. We discuss their properties: the relation to other classes, a compact realizatio...

متن کامل

Steganography Scheme Based on Reed-Muller Code with Improving Payload and Ability to Retrieval of Destroyed Data for Digital Images

In this paper, a new steganography scheme with high embedding payload and good visual quality is presented. Before embedding process, secret information is encoded as block using Reed-Muller error correction code. After data encoding and embedding into the low-order bits of host image, modulus function is used to increase visual quality of stego image. Since the proposed method is able to embed...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1504.04773  شماره 

صفحات  -

تاریخ انتشار 2015